The least square nucleolus is a normalized Banzhaf value
نویسندگان
چکیده
منابع مشابه
The least square nucleolus is a normalized Banzhaf value
In this note we study a truncated additive normalization of the Banzhaf value. We are able to show that it corresponds to the Least Square nucleolus (LS-nucleolus), which was originally introduced as the solution of a constrained optimization problem (Ruiz et al., 1996). Thus, the main result provides an explicit expression that eases the computation and contributes to the understanding of the ...
متن کاملThe Normalized Banzhaf Vallte and the Banzhaf Share Function
A cooperative game with transferable utilities -or simply a TU-gamedescribes a situation in which players can obtain certain payoffs by cooperation. A value function for these games is a function which assigns to every such a game a distribution of payoffs over the players in the game. A famous solution concept for TU-games is the Banzhaf value. This Banzhaf value is not efficient, i.e., in gen...
متن کاملAdaptive Noise Cancellation using Modified Normalized Least Mean Square Algorithm
This paper presents an efficient design of Adaptive filters which uses enhanced NLMS algorithm for eliminating noise added by mean of various communication media or any other noise sources. By using the appropriate weights, Adaptive filter estimates and remove the estimated noise signal from the available information. LMS and Normalized LMS are two most efficient algorithm for noise cancelation...
متن کاملVariable Regularization Parameter Normalized Least Mean Square Adaptive Filter
We present a normalized LMS (NLMS) algorithm with robust regularization. Unlike conventional NLMS with the fixed regularization parameter, the proposed approach dynamically updates the regularization parameter. By exploiting a gradient descent direction, we derive a computationally efficient and robust update scheme for the regularization parameter. In simulation, we demonstrate the proposed al...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2014
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-014-0840-9